Properties of bounds on computation
نویسندگان
چکیده
Partial recursive functions which equal the amount of time or space required by computations have special properties which distinguish them from arbitrary partial recursive functions. Our main result illustrates a property of running times similar in interpretation to Borodin's gap theorem. The proof is based on the construction of difficult to compute characteristic functions which take the value one very infrequently.
منابع مشابه
A Survey on Stability Measure of Networks
In this paper we discuss about tenacity and its properties in stability calculation. We indicate relationships between tenacity and connectivity, tenacity and binding number, tenacity and toughness. We also give good lower and upper bounds for tenacity.
متن کاملOn Integral Operator and Argument Estimation of a Novel Subclass of Harmonic Univalent Functions
Abstract. In this paper we define and verify a subclass of harmonic univalent functions involving the argument of complex-value functions of the form f = h + ¯g and investigate some properties of this subclass e.g. necessary and sufficient coefficient bounds, extreme points, distortion bounds and Hadamard product.Abstract. In this paper we define and verify a subclass of harmonic univalent func...
متن کاملEdge-tenacity in Networks
Numerous networks as, for example, road networks, electrical networks and communication networks can be modeled by a graph. Many attempts have been made to determine how well such a network is "connected" or stated differently how much effort is required to break down communication in the system between at least some nodes. Two well-known measures that indicate how "reliable" a graph is are the...
متن کاملStochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملProperties of the Mixed /spl mu/ Problem and Its Bounds - Automatic Control, IEEE Transactions on
Upper and lower bounds for the mixed p problem have recently been developed, and here we examine the relationship of these bounds to each other and to p. A number of interesting properties are developed, and the implications of these properties for the robustness analysis of linear systems and the development of practical computation schemes are discussed. In particular we find that current tec...
متن کاملOn the eigenvalues of some matrices based on vertex degree
The aim of this paper is to compute some bounds of forgotten index and then we present spectral properties of this index. In continuing, we define a new version of energy namely ISI energy corresponded to the ISI index and then we determine some bounds for it.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003